Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

CSCI-UA: Theory of Computation Problem Set 1 For this problem set, the alphabet is Σ = {0, 1} unless otherwise specified. All problems are worth 10 points. Collaboration is allowed, but you must write your own

Source URL: ftp.cs.nyu.edu

Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine†

Source URL: www.eecs.tufts.edu

• Mathematics
• Algebra
• Graph theory
• Convex analysis
• Convex geometry
• Algebraic graph theory
• Dual graph
• Convex set
• Line segment
• Convex function

University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

Source URL: www.mimuw.edu.pl

MATH CIRCLE - SET THEORY WEEKS 5-7 SAM LICHTENSTEIN It’s been a few weeks since I put notes online. Sorry for the delay! Let me try to reconstruct some of what was covered in the class since Week 5. The necessity of ax

Source URL: themathcircle.org

MATH 592 SPRING 2010 TOPICS IN ERGODIC THEORY PROBLEM SET 4 1. Show that T is ergodic if and only if the only T-invariant measurable functions are the functions which are constant almost everywhere. 2. Show that the map

Source URL: www.juliawolf.org

NetworkX Reference Release 1.9 Aric Hagberg, Dan Schult, Pieter Swart June 21, 2014

Source URL: networkx.github.io

• Graph theory
• NetworkX
• Graph
• DOT
• Line graph
• Multigraph
• Independent set
• Directed graph
• Connectivity
• Sparksee
• Clique
• Degree

Category theory as an autonomous foundation Abstract Does category theory provide a foundation for mathematics that is autonomous with respect to the orthodox foundation in a set theory such as ZFC? We distinguish three

Source URL: oysteinlinnebo.org

Universality and embeddability amongst the models of set theory Joel David Hamkins1,2,3,? 1 New York University, Department of Philosophy, 5 Washington Place

Source URL: jdh.hamkins.org

NetworkX Reference Release 1.11 Aric Hagberg, Dan Schult, Pieter Swart January 31, 2016

Source URL: media.readthedocs.org

• Graph theory
• NetworkX
• Graph
• Line graph
• DOT
• Multigraph
• Independent set
• Directed graph
• Sparksee
• Connectivity
• Clique
• Degree